Four Attributes of an Excellent Peer Review
نویسندگان
چکیده
منابع مشابه
the impact of peer review on efl reviewers writing proficiency
امروزه تصحیح همکلاسی در کلاسهای نگارش یکی از اجزاء لاینفک کلاسهای دانش آموز محور است. تاثیرات مفید تصحیح همکلاسی بر زبان آموزان، معلمان را متقاعد کرده است که علیرغم صرف زمان، انرژی و توان بسیار، از این شیوه ی آموزشی در کلاسهای آموزش نگارش بهره بگیرند. تحقیق حاضر بر آن است تا با مقایسه دو گروه از یادگیرندگان زبان انگلیسی، تاثیر تصحیح همکلاسی را بر توانایی نوشتاری آنها نشان دهد. 122 خانم زبان آمو...
15 صفحه اولOpen peer review at four STEM journals: an observational overview
Open peer review, peer review where authors' and reviewers' identities are disclosed to one another, is a growing trend in scholarly publishing. Through observation of four journals in STEM disciplines, PLOS One, Atmospheric Chemistry & Physics, PeerJ, and F1000Research, an observational overview is conducted. The overview relies on defined characteristics of open peer review. Results show that...
متن کاملAttributes of excellent attending-physician role models.
BACKGROUND Although effective role models are important in medical education, little is known about the characteristics of physicians who serve as excellent clinical role models. We therefore conducted a case-control study to identify attributes that distinguish such physicians from their colleagues. METHODS We asked members of the internal-medicine house staff at four teaching hospitals to n...
متن کاملFour-coloring Ps6-free graphs. I. Extending an excellent precoloring
This is the first paper in a series whose goal is to give a polynomial time algorithm for the 4-coloring problem and the 4-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the 4-coloring problem for graphs with a connec...
متن کاملFour-coloring $P_6$-free graphs. I. Extending an excellent precoloring
This is the first paper in a series whose goal is to give a polynomial time algorithm for the $4$-coloring problem and the $4$-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the $4$-coloring problem for graphs with a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optical Engineering
سال: 2016
ISSN: 0091-3286
DOI: 10.1117/1.oe.55.7.070101